An optimal solution for the budgets assignment problem

Municipalities are service organizations that have a major role in strategic planning and community development consider the future changes society developments, by implementing set of projects with pre-allocated budgets. Projects standards, budgets constraints differ from one to another city another. Fair distributing different municipalities, while ensuring provision various capabilities reach developmental is NP-Hard problem. Assuming all municipalities same characteristics. The problem as follows: given budgets, how distribute minimum budget gap between municipalities. To derive equity distribution this paper developed lower bounds eleven heuristics be utilized branch-and-bound algorithms. performance heuristics, exact solutions presented experimental study.